A Trivariate Interpolation Algorithm Using a Cube-Partition Searching Procedure
نویسندگان
چکیده
منابع مشابه
A PUM interpolation algorithm using a cell-based searching procedure
In this paper we propose a fast algorithm for the bivariate interpolation of large scattered data sets. It is based on the Partition of Unity Method (PUM) [3] and involves radial basis functions as local approximants. The PUM algorithm is efficiently implemented and optimized by connecting the method itself with an effective cell-based searching procedure. More precisely, we construct a cell st...
متن کاملA partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملSearching a multivariate partition space using weighted MAX-SAT
Because of the huge number of partitions of even a moderately sized dataset, even when Bayes factors have a closed form, a comprehensive search for the highest scoring (MAP) partition is usually impossible. Therefore, both deterministic or random search algorithms traverse only a small proportion of partitions of a large dataset. The main contribution of this paper is to encode the formal Bayes...
متن کاملSearching for Features using a Genetic Algorithm
Automatic classification of words use abstract representations of lexical items. The representations are usually not easily derived from the data available (strings of letters). This is a core problem in nearest neighbor methods. This article describes research towards a genetic algorithm for inventing features of relevance for automatic word classification. The GA attempts to optimize a repres...
متن کاملScattered and track data interpolation using an efficient strip searching procedure
A new local algorithm for bivariate interpolation of large sets of scattered and track data is presented. The method, which changes partially depending on the kind of data, is based on the partition of the interpolation domain in a suitable number of parallel strips, and, starting from these, on the construction for any data point of a square neighbourhood containing a convenient number of data...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2015
ISSN: 1064-8275,1095-7197
DOI: 10.1137/140989157